Block Designs and Electrical Networks

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimizing Neural Networks for the Generation of Block Designs

This work describes the evaluation of several search algorithms , based on optimizing neural networks, as applied to a family of problems : the generation of block-designs. Given a set (v; b; u) of parameters (v rows, b columns and u ones), a block design is any v b-binary con guration that has the following properties: u ones, r ones per row, k ones per column, and correlation between pairs of...

متن کامل

Key predistribution schemes for distributed sensor networks via block designs

Key predistribution schemes for distributed sensor networks have received significant attention in the recent literature. In this paper we propose a new construction method for these schemes based on combinations of duals of standard block designs. Our method is a broad spectrum one which works for any intersection threshold. By varying the initial designs, we can generate various schemes and t...

متن کامل

Ramsey Graphs and Block Designs

This paper establishes a connection between a certain class of Ramsey numbers for graphs and the class of symmetric block designs admitting a polarity. The main case considered here relates the projective planes over Galois fields to the Ramsey numbers R(Ca, Kx „) = f(n). It is shown that, for 2 2 ' 2 2 every prime power q, f(q + 1) = q + q + 2, and f(q ) = q + q + 1.

متن کامل

Some Block Designs Constructed from Resolvable Designs

LetD be a resolvable 2−(v, k, λ) design, andD′ be a 2−(v′, k′, λ′) design, such that v′ = v k . Further, let r and r′ be replication numbers of a point in D and D′, respectively. Shrikhande and Raghavarao proved that then there exists a 2 − (v′′, k′′, λ′′) design D′′, such that v′′ = v, k′′ = kk′ and λ′′ = r′λ + (r − λ)λ′. If D′ is resolvable, then D′′ is also resolvable. Applying this result, ...

متن کامل

Thickly-resolvable block designs

We show that the necessary divisibility conditions for the existence of a σ-resolvable BIBD(v, k, λ) are sufficient for large v. The key idea is to form an auxiliary graph based on an [r, k]-configuration with r = σ, and then edge-decompose the complete λ-fold graph K (λ) v into this graph. As a consequence, we initiate a similar existence theory for incomplete designs with index λ. ∗ Supported...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Annals of Statistics

سال: 1991

ISSN: 0090-5364

DOI: 10.1214/aos/1176348134